Search for: All records

We present novel schemes for cache-aided communication over networks with a multi-antenna base station (BS) that serves multiple single-antenna users. The schemes are based on a greedy scheduling [1], which simultaneously transmits coded messages to disjoint groups of users. The proposed algorithms use the channel state information to opportunistically choose the groups to be served together and to allocate power to each coded message in order to minimize the overall communication delay. Numerical study shows that the new schemes outperform the previously known schemes. 

We present a novel low-complexity scheme for cache-aided communication, where a multi-antenna base station serves multiple single-antenna mobile users. The scheme is based on dividing the users into meta-users, where all users in the same meta-user store the same content during the placement phase. The inter meta-user interference is mitigated by using the cache as well as zero forcing, while the interference between users of the same meta-user is mitigated by zero forcing. Compared to the current state of the art, this scheme is feasible for a wider range of parameters. Moreover, while still achieving the optimal number of degrees of freedom (DoF), the proposed scheme imposes the same or less complexity compared to all the known schemes for each set of parameters. Consequently, the proposed scheme enables practical implementation of cache-aided communication for a large number of users. 

We present a novel scheme for cache-aided communication over multiple-input and single output (MISO) cellular networks. The presented scheme achieves the same number of degrees of freedom as known coded caching schemes, but, at much lower complexity. The scheme is derived for communication systems with heterogeneous rates and finite signal-to-noise ratio, in which links are modeled by wideband fading channels. The base station is serving multiple users simultaneously, by sending a combination of several packets, each intended for one user. The interference is either suppressed using the cache content or nulled by zero-forcing at the unintended users. We focus on efficient coding schemes, which allow for a maximum number of users to be served throughout the course of communication. An achievable rate region is characterized by determining the extreme rate vectors satisfying an efficient transmission. The analysis results in a simple scheduling scheme and in a closed-form performance analysis.